Approximation algorithms for Max Morse Matching
نویسندگان
چکیده
منابع مشابه
Approximation algorithms for Max Morse Matching
In this paper, we prove that the Max-Morse Matching Problem is approximable, thus resolving an open problem posed by Joswig and Pfetsch [14]. We describe two different approximation algorithms for the Max-Morse Matching Problem. For D–dimensional simplicial complexes, we obtain a (D+1)/(D2+D+1)factor approximation ratio using a simple edge reorientation algorithm that removes cycles. Our second...
متن کاملHardness of Approximation for Morse Matching
We consider the approximability of maximization and minimization variants of the Morse matching problem, posed as open problems by Joswig and Pfetsch [12]. We establish hardness results for MaxMorse matching and Min-Morse matching. In particular, we show that, for a simplicial complex with n simplices and dimension d ≥ 3, it is NP-hard to approximate Min-Morse matching within a factor of O(n), ...
متن کاملApproximation Algorithms for MAX SAT
Maximum Satisfiability Problem (MAX SAT) is one of the most natural optimization problems. It is known to be NP-hard. Hence, approximation algorithms have been considered. The aim of this survey is to show recent developments of approximation algorithms for MAX SAT. We will confine ourselves to approximation algorithms with theoretical performance guarantees. For other approximation algorithms ...
متن کاملApproximation algorithms for MAX-MIN tiling
The MAX-MIN tiling problem is as follows. We are given A[1, . . . , n][1, . . . , n], a two-dimensional array where each entry A[i][j ] stores a non-negative number. Define a tile of A to be a subarray A[ , . . . , r][t, . . . , b] of A, the weight of a tile to be the sum of all array entries in it, and a tiling of A to be a collection of tiles of A such that each entry A[i][j ] is contained in...
متن کاملApproximation Algorithms for the Max-coloring Problem
Given a graph G = (V,E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . , Ck, minimize ∑k i=1 maxv∈Ciw(v). The problem arises in scheduling conflicting jobs in batches and in minimizing buffer size in dedicated memory managers. In this paper we present three approximation algorithms and one in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2017
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2016.10.002